-
1 analytical hierarchy theorem
Математика: теорема об аналитической иерархииУниверсальный англо-русский словарь > analytical hierarchy theorem
-
2 analytical hierarchy theorem
English-Russian scientific dictionary > analytical hierarchy theorem
-
3 theorem
- analytical hierarchy theorem - arithmetical hierarchy theorem - closed range theorem - formally provable theorem - implicit function theorem - initial value theorem - integral representation theorem - local limit theorem - maximal ergodic theorem - mean value theorem - normal form theorem - ratio limit theorem - rational root theorem - second mean value theorem - theorem of consistency proofs - theorem of corresponding states - three line theorem - three series theorem - uniform convergence theorem - uniform ergodic theorem - uniform mean value theoremtheorem implies — из теоремы следует, что…
См. также в других словарях:
Arithmetical hierarchy — In mathematical logic, the arithmetical hierarchy, arithmetic hierarchy or Kleene hierarchy classifies certain sets based on the complexity of formulas that define them. Any set that receives a classification is called arithmetical. The… … Wikipedia
Borel hierarchy — In mathematical logic, the Borel hierarchy is a stratification of the Borel algebra generated by the open subsets of a Polish space; elements of this algebra are called Borel sets. Each Borel set is assigned a unique countable ordinal number… … Wikipedia
List of philosophy topics (A-C) — 110th century philosophy 11th century philosophy 12th century philosophy 13th century philosophy 14th century philosophy 15th century philosophy 16th century philosophy 17th century philosophy 18th century philosophy 19th century philosophy220th… … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
List of mathematical logic topics — Clicking on related changes shows a list of most recent edits of articles to which this page links. This page links to itself in order that recent changes to this page will also be included in related changes. This is a list of mathematical logic … Wikipedia
List of mathematics articles (A) — NOTOC A A Beautiful Mind A Beautiful Mind (book) A Beautiful Mind (film) A Brief History of Time (film) A Course of Pure Mathematics A curious identity involving binomial coefficients A derivation of the discrete Fourier transform A equivalence A … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
List of computability and complexity topics — This is a list of computability and complexity topics, by Wikipedia page. Computability theory is the part of the theory of computation that deals with what can be computed, in principle. Computational complexity theory deals with how hard… … Wikipedia
Hyperarithmetical theory — In recursion theory, hyperarithmetic theory is a generalization of Turing computability. It has close connections with definability in second order arithmetic and with weak systems of set theory such as Kripke–Platek set theory. It is an… … Wikipedia
Reverse mathematics — is a program in mathematical logic that seeks to determine which axioms are required to prove theorems of mathematics. The method can briefly be described as going backwards from the theorems to the axioms. This contrasts with the ordinary… … Wikipedia
George Boolos — Infobox Person name = George Boolos birth date = birth date|1940|9|4|mf=y birth place = New York, New York, U.S. death date = death date and age|1996|5|27|1940|9|4|mf=y death place = Cambridge, Massachusetts, U.S.George Stephen Boolos (September… … Wikipedia